Sylvester-Gallai Theorem and Metric Betweenness

نویسنده

  • Vasek Chvátal
چکیده

Sylvester conjectured in 1893 and Gallai proved some forty years later that every finite set S of points in the plane includes two points such that the line passing through them includes either no other point of S or all other points of S. There are several ways of extending the notion of lines from Euclidean spaces to arbitrary metric spaces. We present one of them and conjecture that, with lines in metric spaces defined in this way, the Sylvester-Gallai theorem generalizes as follows: in every finite metric space, there is a line consisting of either two points or all the points of the space. Then we present meagre evidence in support of this rash conjecture and finally we discuss the underlying ternary relation of metric betweenness. 1 The Sylvester-Gallai theorem In March 1893, Sylvester [33] proposed the following problem: Prove that it is not possible to arrange any finite number of real points so that a right line through every two of them shall pass through a third, unless they all lie in the same right line. The May 1893 issue of the same journal reports a four-line “solution” proposed by H.J. Woodall, A.R.C.S., followed by a comment pointing out two flaws in the argument and sketching another line of enquiry, which “. . . is equally incomplete, but may be worth notice”. Some forty years later, Erdös revived the problem and the first prooof was found shortly afterwards by T. Gallai (named Grünwald at that time): see Erdös [15]. Additional proofs were given by R.C. Buck, N.E. Steenrod, and R. Steinberg; in particular, Steinberg’s proof may be seen as a projective variation on Gallai’s affine theme; Coxeter ([10]; §12.3 of [11]) transformed it into an even more elementary form. The theorem also follows, through projective duality, from a result of Melchior [24], proved by a simple application of Euler’s polyhedral formula. A very short proof was given by L.M. Kelly; this proof uses the notion of Euclidean distance and can be found in Coxeter ([10]; §4.7 of [11]) and Gale (Chapter 8 of [18]). Further information

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Sylvester-Chvatal Theorem

The Sylvester-Gallai theorem asserts that every finite set S of points in two-dimensional Euclidean space includes two points, a and b, such that either there is no other point in S is on the line ab, or the line ab contains all the points in S. V. Chvátal extended the notion of lines to arbitrary metric spaces and made a conjecture that generalizes the Sylvester-Gallai theorem. In the present ...

متن کامل

Sylvester-Gallai type theorems for approximate collinearity

We study questions in incidence geometry where the precise position of points is ‘blurry’ (e.g. due to noise, inaccuracy or error). Thus lines are replaced by narrow tubes, and more generally affine subspaces are replaced by their small neighborhood. We show that the presence of a sufficiently large number of approximately collinear triples in a set of points in C implies that the points are cl...

متن کامل

A Reverse Analysis of the Sylvester-Gallai Theorem

Reverse analyses of three proofs of the Sylvester-Gallai theorem lead to three different and incompatible axiom systems. In particular, we show that proofs respecting the purity of the method, using only notions considered to be part of the statement of the theorem to be proved, are not always the simplest, as they may require axioms which proofs using extraneous predicates do not rely upon.

متن کامل

Extremal Problems Related to the Sylvester–Gallai Theorem

We discuss certain extremal problems in combinatorial geometry, including Sylvester’s problem and its generalizations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2004